Verification of Graph Transformation Systems with Context-Free Specifications
نویسندگان
چکیده
We introduce an analysis method for graph transformation systems which checks that certain forbidden graphs are not reachable from the start graph. These forbidden graphs are specified by a contextfree graph grammar. The technique is based on the approximation of graph transformation systems by Petri nets and on semilinear sets of markings. Especially we exploit Parikh’s theorem which says that the Parikh image of a context-free grammar is semilinear. An important application is deadlock analysis for interaction nets and we specifically show how to apply the technique to an infinite-state dining philosopher’s system.
منابع مشابه
A Hybrid Meta-heuristic Approach to Cope with State Space Explosion in Model Checking Technique for Deadlock Freeness
Model checking is an automatic technique for software verification through which all reachable states are generated from an initial state to finding errors and desirable patterns. In the model checking approach, the behavior and structure of system should be modeled. Graph transformation system is a graphical formal modeling language to specify and model the system. However, modeling of large s...
متن کاملDevelopment of correct graph transformation systems
Graph transformation has many application areas in computer science, such as software engineering or the design of concurrent and distributed systems. Being a visual modeling technique, graph transformation has the potential to play a decisive role in the development of increasingly larger and complex systems. However, the use of visual modeling techniques alone does not guarantee the correctne...
متن کاملOn the Decidability Status of Reachability and Coverability in Graph Transformation Systems
We study decidability issues for reachability problems in graph transformation systems, a powerful infinite-state model. For a fixed initial configuration, we consider reachability of an entirely specified configuration and of a configuration that satisfies a given pattern (coverability). The former is a fundamental problem for any computational model, the latter is strictly related to verifica...
متن کاملViewing Graph Transformation through the Algorithmic Lens
We present an algorithmic view of graph transformation systems, a powerful infinite-state system model, obtained through a study of decidability issues for reachability problems. Fora fixed initial configuration, we consider reachability of an entirely specified configuration and of aconfiguration that satisfies a given pattern (coverability). The former is a fundamental problem for...
متن کاملENTROPY OF DYNAMICAL SYSTEMS ON WEIGHTS OF A GRAPH
Let $G$ be a finite simple graph whose vertices and edges are weighted by two functions. In this paper we shall define and calculate entropy of a dynamical system on weights of the graph $G$, by using the weights of vertices and edges of $G$. We examine the conditions under which entropy of the dynamical system is zero, possitive or $+infty$. At the end it is shown that, for $rin [0,+infty]$, t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010